Introducing the MCHF/OVRP/SDMP: Multicapacitated/Heterogeneous Fleet/Open Vehicle Routing Problems with Split Deliveries and Multiproducts
نویسندگان
چکیده
منابع مشابه
Introducing the MCHF/OVRP/SDMP: Multicapacitated/Heterogeneous Fleet/Open Vehicle Routing Problems with Split Deliveries and Multiproducts
In this paper, we analyze a real-world OVRP problem for a production company. Considering real-world constrains, we classify our problem as multicapacitated/heterogeneous fleet/open vehicle routing problem with split deliveries and multiproduct (MCHF/OVRP/SDMP) which is a novel classification of an OVRP. We have developed a mixed integer programming (MIP) model for the problem and generated tes...
متن کاملVehicle Routing with Time Windows and Split Deliveries
In this presentation, we consider the Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) in which the delivery to a customer can be split between any number of vehicles. This problem has not been extensively studied in the literature. The main contribution of this paper is a Branch and Price approach for solving the SDVRPTW without imposing restrictions on the split delivery opt...
متن کاملBranch and price for the vehicle routing problem with discrete split deliveries and time windows
The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles’ capacity and customer time windows. The delivery request of a customer is discrete since it consists of several items that cannot be split further. The problem belongs to the c...
متن کاملExploring Heuristics for the Vehicle Routing Problem with Split Deliveries and Time Windows Dissertation
This dissertation investigates the Vehicle Routing Problem with Split Deliveries and Time Windows. This problem assumes a depot of homogeneous vehicles and set of customers with deterministic demands requiring delivery. Split deliveries allow multiple visits to a customer and time windows restrict the time during which a delivery can be made. Several construction and local search heuristics are...
متن کاملA tabu search heuristic for the vehicle routing problem with time windows and split deliveries
In this paper, we consider the Vehicle Routing Problem with Time Windows and Split Deliveries (VRPTWSD) and present a solution method based on Tabu Search and four different neighborhood structures. This problem is an extension of the Vehicle Routing Problem, where the start of service at each customer must be within a time window, and a customer may be serviced by more than one vehicle. The he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/515402